Nuprl Lemma : ecl-halt-ex 11,40

ds:fpf(Id; x.Type), da:fpf(Knd; k.Type), x:ecl(dsda), m:L:(event-info(ds;da) List).
(ecl-halt(dsdax)(m,L))  (m  cons(0; ecl-ex(x))) 
latex


Definitionsx:A  B(x), , a < b, s = t, A c B, x:AB(x), (x  l), prop{i:l}, t  T, x:AB(x), fpf(Aa.B(a)), rec(x.A(x)), ecl(dsda), {x:AB(x)} , type List, f(a), False, A, P  Q, ecl-ex(x), guard(T), P  Q, left + right, decidable(P), , Type, x:AB(x), P  Q, P  Q, P  Q, s-insert(xl), , A  B, iseg(Tl1l2), merge(asbs), void, #$n, subtype(ST), <ab>, b, , Unit, if b then t else f fi , True, T, (i = j), b, l_all(LTx.P(x)), star-append(TPQ), ecl ind eclcatch compseq tag def, ecl ind eclthrow compseq tag def, ecl ind eclact compseq tag def, ecl ind eclrepeat compseq tag def, ecl ind eclor compseq tag def, ecl ind ecland compseq tag def, ecl ind eclseq compseq tag def, ecl ind eclbase compseq tag def, ecl-halt(dsdax), event-info(ds;da), eclcatch(al), eclthrow(an), eclact(an), cons(carcdr), eclrepeat(a), eclor(ab), ecland(ab), eclseq(ab), ma-valtype(dak), decl-state(ds), eclbase(ktest), Knd, x.A(x), xt(x), Id, sq_type(T)
Lemmasdecidable int equal, Id wf, fpf wf, Knd wf, ecl-induction, ecl wf, eclbase wf, decl-state wf, ma-valtype wf, eclseq wf, ecland wf, eclor wf, eclrepeat wf, eclact wf, nat wf, eclthrow wf, ecl-halt wf, eclcatch wf, event-info wf, member singleton, member-merge, bool wf, bnot wf, not wf, assert wf, ifthenelse wf, eq int wf, eqtt to assert, eqff to assert, iff transitivity, assert of bnot, not functionality wrt iff, assert of eq int, ecl-ex wf, nat plus inc, nat plus wf, merge wf, le wf, cons member, s-insert wf, member-s-insert, decidable equal nat, l member wf, l member subtype

origin